Consistent segment-wise matching with multi-layer graphs
نویسندگان
چکیده
منابع مشابه
Distributable Consistent Multi-Graph Matching
In this paper we propose an optimization-based framework to multiple graph matching. The framework takes as input maps computed between pairs of graphs, and outputs maps that 1) are consistent among all pairs of graphs, and 2) preserve edge connectivity between pairs of graphs. We show how to formulate this as solving a piece-wise low-rank matrix recovery problem using a generalized message pas...
متن کاملMulti-attributed Graph Matching with Multi-layer Random Walks
This paper addresses the multi-attributed graph matching problem considering multiple attributes jointly while preserving the characteristics of each attribute. Since most of conventional graph matching algorithms integrate multiple attributes to construct a single attribute in an oversimplified way, the information from multiple attributes are not often fully exploited. In order to solve this ...
متن کاملMulti-image Matching Using Segment Features
This paper presents a strategy for matching features in multiple images, which emphasises reliable matching and the recovery of feature extraction errors. The process starts from initial ‘good’ matches, which are validated in multiple images using multi-image constraints. These initial matches are then filtered through a relaxation procedure and are subsequently used to locally predict addition...
متن کاملTrain Feedfoward Neural Network with Layer-wise Adaptive Rate via Approximating Back-matching Propagation
Stochastic gradient descent (SGD) has achieved great success in training deep neural network, where the gradient is computed through backpropagation. However, the back-propagated values of different layers vary dramatically. This inconsistence of gradient magnitude across different layers renders optimization of deep neural network with a single learning rate problematic. We introduce the back-...
متن کاملFlexible Network Binarization with Layer-wise Priority
How to effectively approximate real-valued parameters with binary codes plays a central role in neural network binarization. In this work, we reveal an important fact that binarizing different layers has a widely-varied effect on the compression ratio of network and the loss of performance. Based on this fact, we propose a novel and flexible neural network binarization method by introducing the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 2019
ISSN: 0167-8396
DOI: 10.1016/j.cagd.2019.04.003